Parallel sparse linear solver with GMRES method using minimization techniques of communications for GPU clusters
نویسندگان
چکیده
منابع مشابه
Parallel GMRES implementation for solving sparse linear systems on GPU clusters
In this paper, we propose an efficient parallel implementation of the GMRES method for GPU clusters. This implementation requires us to parallelize the GMRES algorithm between CPUs of the cluster. Hence, all parallel and intensive computations on local data are performed on GPUs and reduction operations to compute global results are carried out by CPUs. The performances of our parallel GMRES so...
متن کاملCoding Method for Parallel Iterative Linear Solver
Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea of “coded computation” to design a novel error-correctingcode inspired technique for solving linear inverse problems under specific iterative methods in a parallelized implementation affected by stragglers. Example app...
متن کاملSPIKE::GPU A SPIKE-based preconditioned GPU Solver for Sparse Linear Systems
This contribution outlines an approach that draws on general purpose graphics processing unit (GPGPU) computing to solve large linear systems. To methodology proposed relies on a SPIKE-based preconditioner with a Krylov-subspace method and has the following three stages: (i) row/column reordering for boosting diagonal dominance and reducing bandwidth; (ii) applying single precision truncated SP...
متن کاملA parallel row projection solver for large sparse linear systems
In this paper we present a parallel iterative solver for large and sparse nonsymmetric linear systems. The solver is based on a row-projection algorithm, derived from the symmetrized block version of the Kacz-marz method with Conjugate Gradient acceleration. A comparison with some h'rylov subspace methods shows the remarkable robustness of this algorithm when applied to systems with eingevalues...
متن کاملA domain-decomposing parallel sparse linear system solver
The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2014
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-014-1143-8